Adaptive Hierarchical Fair Competition (AHFC) Model For Parallel Evolutionary Algorithms
نویسندگان
چکیده
The HFC model for parallel evolutionary computation is inspired by the stratified competition often seen in society and biology. Subpopulations are stratified by fitness. Individuals move from low-fitness to higher-fitness subpopulations if and only if they exceed the fitness-based admission threshold of the receiving subpopulation, but not of a higher one. The HFC model implements several critical features of a competent parallel evolutionary computation model, simultaneously and naturally, allowing rapid exploitation while impeding premature convergence. The AHFC model is an adaptive version of HFC, extending it by allowing the admission thresholds of fitness levels to be determined dynamically by the evolution process itself. The effectiveness of the Adaptive HFC model is compared with the HFC model on a genetic programming-based evolutionary synthesis example.
منابع مشابه
The Hierarchical Fair Competition (HFC) Model for Parallel Evolutionary Algorithms
The HFC model for evolutionary computation is inspired by the stratified competition often seen in society and biology. Subpopulations are stratified by fitness. Individuals move from low-fitness subpopulations to higher-fitness subpopulations if and only if they exceed the fitness-based admission threshold of the receiving subpopulation, but not of a higher one. HFC’s balanced exploration and ...
متن کاملEvolvable fuzzy controllers using parallel evolutionary algorithms
We are trying to piece together the knowledge of evolution with the help of biology, informatics and physics to create complex evolutionary algorithms with parallel and hierarchical structure. It can speed up the creation of optimization algorithms with high quality features. The adaptive significance of genetic algorithms (GAs) with diploid chromosomes and an artificial immune system has been ...
متن کاملRobust and Efficient Genetic Algorithms with Hierarchical Niching and a Sustainable Evolutionary Computation Model
This paper proposes a new niching method named hierarchical niching, which combines spatial niching in search space and a continuous temporal niching concept. The method is naturally implemented as a new genetic algorithm, QHFC, under a sustainable evolutionary computation model: the Hierarchical Fair Competition (HFC) Model. By combining the benefits of the temporally continuing search capabil...
متن کاملCompetition Model for Sustainable Innovation in Genetic Programming
Lack of sustainable search capability of genetic programming has severely constrained its application to more complex problems. A new evolutionary algorithm model named the continuous hierarchical fair competition (CHFC) model is proposed to improve the capability of sustainable innovation for single population genetic programming. It is devised by extracting the fundamental principles underlyi...
متن کاملThe Hierarchical Fair Competition (HFC) Framework for Sustainable Evolutionary Algorithms
Many current Evolutionary Algorithms (EAs) suffer from a tendency to converge prematurely or stagnate without progress for complex problems. This may be due to the loss of or failure to discover certain valuable genetic material or the loss of the capability to discover new genetic material before convergence has limited the algorithm's ability to search widely. In this paper, the Hierarchical ...
متن کامل